Space Bounds for Graph Connectivity Problems on Node-named JAGs and Node-ordered JAGs
نویسنده
چکیده
Two new models, NO-JAG and NN-JAG in order of increasing computation power, are introduced as extensions to the conventional JAG model. A space lower bound of R(log2 n/ loglog 11) is proved for the problem of directed st-connectivity on a probabilistic NN-JAG and a space upper bound of O(1og n ) is proved for the problem of directed st-nonconnectivity on a nondeterministic NO-JAG. It as also shown that a nondeterministic NO-JAG is nearly as powerful as a nondeterministic Turing machine.
منابع مشابه
Power of Nondetreministic JAGs on Cayley graphs
The Immerman-Szelepcsenyi Theorem uses an algorithm for co-stconnectivity based on inductive counting to prove that NLOGSPACE is closed under complementation. We want to investigate whether counting is necessary for this theorem to hold. Concretely, we show that Nondeterministic Jumping Graph Autmata (ND-JAGs) (pebble automata on graphs), on several families of Cayley graphs, are equal in power...
متن کاملOn the Complexity of the St-connectivity Problem
On the complexity of the st-connectivity problem Chung Keung Poon Doctor of Philosophy 1996 Department of Computer Science University of Toronto The directed st-connectivity problem is fundamental to computer science. There are many applications which require algorithms to solve the problem in small space and preferably in small time as well. Furthermore, its space and time-space complexities a...
متن کاملIncidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کاملExtending JAGS: a tutorial on adding custom distributions to JAGS (with a diffusion model example).
We demonstrate how to add a custom distribution into the general-purpose, open-source, cross-platform graphical modeling package JAGS ("Just Another Gibbs Sampler"). JAGS is intended to be modular and extensible, and modules written in the way laid out here can be loaded at runtime as needed and do not interfere with regular JAGS functionality when not loaded. Writing custom extensions requires...
متن کاملSimulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs
In a breakthrough result, Reingold [17] showed that the Undirected st-Connectivity problem can be solved in O(log n) space. The next major challenge in this direction is whether one can extend it to directed graphs, and thereby lowering the deterministic space complexity ofRL or NL. In this paper, we show that Reingold’s algorithm, the O(log n)space algorithm by Armoni et al. [3] and the O(log ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993